Searching for Low Weight Codewords in Linear Binary Codes
نویسندگان
چکیده
In this work we revisit the known algorithms for searching for low weight codewords in linear binary codes. We propose some improvements on them and also propose a new efficient heuristic.
منابع مشابه
On the non-minimality of the largest weight codewords in the binary Reed-Muller codes
The study of minimal codewords in linear codes was motivated by Massey who described how minimal codewords of a linear code define access structures for secret sharing schemes. As a consequence of his article, Borissov, Manev, and Nikova initiated the study of minimal codewords in the binary Reed-Muller codes. They counted the number of non-minimal codewords of weight 2d in the binary Reed-Mull...
متن کاملOn the Minimum Distance of Non Binary LDPC Codes
Minimum distance is an important parameter of a linear error correcting code. For improved performance of binary Low Density Parity Check (LDPC) codes, we need to have the minimum distance grow fast with n, the codelength. However, the best we can hope for is a linear growth in dmin with n. For binary LDPC codes, the necessary and sufficient conditions on the LDPC ensemble parameters, to ensure...
متن کاملConstructions of binary constant-weight cyclic codes and cyclically permutable codes
A general theorem is proved showing how to ohtain a constant-weight binary cyclic code from a p-ary linear cyclic code, where p is a prime,. by using a representation of Cl;(p) as cyclic shifts of a binary p-tuple. Based on this theorem, constructions are given for four classes of binary constant-weight codes. The first two classes are shown to achieve the Johnson upper bound on minimum distanc...
متن کاملOn a Class of Constant Weight Codes
For any odd prime power q we first construct a certain non-linear binary code C(q, 2) having (q − q)/2 codewords of length q and weight (q − 1)/2 each, for which the Hamming distance between any two distinct codewords is in the range [q/2 − 3√q/2, q/2 + 3√q/2] that is, ‘almost constant’. Moreover, we prove that C(q, 2) is distance-invariant. Several variations and improvements on this theme are...
متن کاملLinear codes with complementary duals related to the complement of the Higman-Sims graph
In this paper we study codes $C_p(overline{{rm HiS}})$ where $p =3,7, 11$ defined by the 3- 7- and 11-modular representations of the simple sporadic group ${rm HS}$ of Higman and Sims of degree 100. With exception of $p=11$ the codes are those defined by the row span of the adjacency matrix of the complement of the Higman-Sims graph over $GF(3)$ and $GF(7).$ We show that these codes ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2008 شماره
صفحات -
تاریخ انتشار 2008